Randomizing O-minimal Theories
نویسندگان
چکیده
The randomization of a complete first order theory T is the complete continuous theory T R with two sorts, a sort for random elements of models of T , and a sort for events in an underlying atomless probability space. We show that if T has the exchange property and acl = dcl, then T R has a strict independence relation in the home sort, and hence is real rosy. In particular, if T is o-minimal, then T R is real rosy.
منابع مشابه
Lovely Pairs and Dense Pairs of O-minimal Structures
We study the theory of Lovely pairs of þ-rank one theories, in particular O-minimal theories. We show that the class of א0-saturated dense pairs of O-minimal structures studied by van den Dries [6] agrees with the corresponding class of lovely pairs. We also prove that the theory of lovely pairs of O-minimal structures is super-rosy of rank ≤ ω.
متن کاملVapnik-chervonenkis Density in Some Theories without the Independence Property, I
We recast the problem of calculating Vapnik-Chervonenkis (VC) density into one of counting types, and thereby calculate bounds (often optimal) on the VC density for some weakly o-minimal, weakly quasi-o-minimal, and P -minimal theories.
متن کاملDistal and non-distal Pairs
The aim of this note is to determine whether certain non-o-minimal expansions of o-minimal theories which are known to be NIP, are also distal. We observe that while tame pairs of o-minimal structures and the real field with a discrete multiplicative subgroup have distal theories, dense pairs of o-minimal structures and related examples do not.
متن کاملSome Two-Cardinal Results for O-Minimal Theories
We examine two-cardinal problems for the class of O-minimal theories. We prove that an O-minimal theory which admits some (κ, λ) must admit every (κ′, λ′). We also prove that every “reasonable” variant of Chang’s Conjecture is true for O-minimal structures. Finally, we generalize these results from the two-cardinal case to the δ-cardinal case for arbitrary ordinals δ.
متن کاملAn O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem
A randomizing algorithm for the weighted Euclidean 1-center problem is pre-xnted. The algorithm is shown to run on any problem in O (n log P I) time with high probability.
متن کامل